#include <bits/stdc++.h>
using namespace std;
int main()
{
int T, i, j;
cin >> T;
while (T--)
{
int n, x, k;
cin >> n >> x >> k;
int sum = 0;
for (i = 0; i < x; i++)
{
sum += i;
n--;
}
if (n < 0 || x - 1 > k)
{
cout << -1 << endl;
}
else if (k == x)
{
sum += (n * (k - 1));
cout << sum << endl;
}
else
{
sum += (n * k);
cout << sum << endl;
}
}
return 0;
}
445. Add Two Numbers II | 442. Find All Duplicates in an Array |
437. Path Sum III | 436. Find Right Interval |
435. Non-overlapping Intervals | 406. Queue Reconstruction by Height |
380. Insert Delete GetRandom O(1) | 332. Reconstruct Itinerary |
368. Largest Divisible Subset | 377. Combination Sum IV |
322. Coin Change | 307. Range Sum Query - Mutable |
287. Find the Duplicate Number | 279. Perfect Squares |
275. H-Index II | 274. H-Index |
260. Single Number III | 240. Search a 2D Matrix II |
238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |